A Structure Theory for the Parametric Submodular Intersection Problem

نویسندگان

  • Satoru Fujishige
  • Kiyohito Nagano
چکیده

Kiyohito NAGANO\dagger (11Lnnnnn!!!llll)))BggX) Abstract A linearly parameterized polymatroid intersection problem appears in the context of principal partitions. We consider a submodular intersection problem on a pair of strong-map sequences of submodular functions, which is an extension of the linearly parameterized polymatroid intersection problem to a nonlinearly parameterized one. We introduce the concept of a basis-frame on a finite nonempty set $V$ that gives a mapping from the set of all base polyhedra in $\mathbb{R}^{V}$ into $\mathbb{R}^{V}$ such that each base polyhe-dron in $\mathbb{R}^{V}$ is mapped to one of its bases. We show the existence of a simple universal representation of all optimal solutions of the parameterized submodular intersection problem by means of basis-frames.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid

We present a new algorithm for the problem of determining the intersection of a half-line Δu = {x ∈ IR | x = λu for λ ≥ 0} with a polymatroid. We then propose a second algorithm which generalizes the first algorithm and solves a parametric linear program. We prove that these two algorithms are strongly polynomial and that their running time is O(n + γn) where γ is the time for an oracle call. T...

متن کامل

Combinatorial Algorithms for Submodular Function Minimization and Related Problems

Submodular functions are common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a number of other combinatorial optimization problems as special cases. In this thesis, we study submodular function minimization and two related pr...

متن کامل

Some Results about the Contractions and the Pendant Pairs of a Submodular System

Submodularity is an important  property of set functions with deep theoretical results  and various  applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization.  Nowadays submodular functions optimization has been attracted by many researchers.  Pendant pairs of a symmetric...

متن کامل

Matchings, matroids and submodular functions

This thesis focuses on three fundamental problems in combinatorial optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing perfect or maximum cardinality mat...

متن کامل

Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization

We consider the problem of jointly inferring the M -best diverse labelings for a binary (high-order) submodular energy of a graphical model. Recently, it was shown that this problem can be solved to a global optimum, for many practically interesting diversity measures. It was noted that the labelings are, so-called, nested. This nestedness property also holds for labelings of a class of paramet...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2009